Packing interval graphs with vertex-disjoint triangles
نویسنده
چکیده
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
منابع مشابه
The Vertex-Disjoint Triangles Problem
The vertex-disjoint triangles (VDT) problem asks for a set of maximum number of pairwise vertex-disjoint triangles in a given graph G. The triangle cover problem asks for the existence of a perfect triangle packing in a graph G. It is known that the triangle cover problem is NPcomplete on general graphs with clique number 3 [6]. The VDT problem is MAX SNP-hard on graphs with maximum degree four...
متن کاملPacking triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + ε, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of...
متن کاملPacking and Covering Triangles in K 4-free Planar Graphs
We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graph...
متن کاملDense Graphs With a Large Triangle Cover Have a Large Triangle Packing
It is well known that a graph with m edges can be made triangle-free by removing (slightly less than) m/2 edges. On the other hand, there are many classes of graphs which are hard to make triangle-free in the sense that it is necessary to remove roughly m/2 edges in order to eliminate all triangles. We prove that dense graphs that are hard to make triangle-free have a large packing of pairwise ...
متن کاملPacking triangles in a graph and its complement
How few edge-disjoint triangles can there be in a graph G on n vertices and in its complement G? This question was posed by P. Erdó́s, who noticed that if G is a disjoint union of two complete graphs of order n=2 then this number is n=12 þ o(n). Erdó́s conjectured that any other graph with n vertices together with its complement should also contain at least that many edge-disjoint triangles. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1202.1041 شماره
صفحات -
تاریخ انتشار 2012